Experiments in integer programming
نویسندگان
چکیده
منابع مشابه
More Branch-and-Bound Experiments in Convex Nonlinear Integer Programming
Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex Mixed-Integer Nonlinear Programming (MINLP) problems. It is well-known that carrying out branching in a non-simplistic manner can greatly enhance the practicality of B&B in the context of Mixed-Integer Linear Programming (MILP). No detailed study of branching has heretofore been carried out for MI...
متن کاملExperiments with Conflict Analysis in Mixed Integer Programming
The analysis of infeasible subproblems plays an import role in solving mixed integer programs (MIPs) and is implemented in most major MIP solvers. There are two fundamentally different concepts to generate valid global constraints from infeasible subproblems. The first is to analyze the sequence of implications obtained by domain propagation that led to infeasibility. The result of the analysis...
متن کاملComputing efficient exact designs of experiments using integer quadratic programming
We propose a method of computing exact experimental designs by integer quadratic programming. The key idea is a suitable quadratic approximation of the criterion of D-optimality in the neighbourhood of the approximate D-optimal information matrix, which we call the criterion of Q-optimality. We demonstrate on several examples that the D-efficiency of the exact Q-optimal designs is usually very ...
متن کاملScheduling experiments on a nuclear reactor using mixed integer programming
This paper describes an approach for scheduling a nuclear reactor that irradiates samples as required by customers. The environment involves a flowshop that consists of two stations, each composed of a set of parallel machines. Some jobs may be preempted, while others may not. Some jobs have deadlines, while others have due-dates. Some jobs require special tooling, while others do not. The prob...
متن کاملDISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1980
ISSN: 0166-218X
DOI: 10.1016/0166-218x(80)90053-0